Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
نویسندگان
چکیده
منابع مشابه
Direct linear time solvers for sparse matrices
In the last couple of years it has been realized that Gaussian elimination for sparse matrices arising from certain elliptic PDEs can be done in O(n log(1/ )) flops, where n is the number of unknowns and is a user-specified tolerance [Chandrasekaran and Gu]. The resulting solver will also be backward stable with an error of O( ). The techniques used to achieve this speedup has some commonality ...
متن کاملLinear System Solvers : Sparse Iterative
In this chapter we will present an overview of a number of related iterative methods for the solution of linear systems of equations. These methods are so-called Krylov projection type methods and they include popular methods as Conjugate Gradients, Bi-Conjugate Gradients, LSQR and GMRES. We will sketch how these methods can be derived from simple basic iteration formulas, and how they are inte...
متن کاملParallel Solvers for Mixed Integer Linear Optimization
In this article, we provide an overview of the current state of the art with respect to solution of mixed integer linear optimization problems (MILPS) in parallel. Sequential algorithms for solving MILPs have improved substantially in the last two decades and commercial MILP solvers are now considered effective off-the-shelf tools for optimization. Although concerted development of parallel MIL...
متن کاملSparse Direct Linear Solvers: An Introduction
The minisymposium on sparse direct solvers included 11 talks on the state of the art in this area. The talks covered a wide spectrum of research activities in this area. The papers in this part of the proceedings are expanded, revised, and corrected versions of some the papers that appeared in the CD-ROM proceedings that were distributed at the conference. Not all the talks in the minisymposium...
متن کاملBlocked Iterative Sparse Linear System Solvers for Finite Fields
Extended Abstract The problem of solving a large sparse or structured system of linear equations in the symbolic context, for instance when the coeecients lie in a nite eld, has arisen in several applications. A famous example are the linear systems over F 2 , the eld with 2 elements, that arise in sieve based integer factoring algorithms. For example, for the factorization of the RSA-130 chall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2017
ISSN: 0895-4798,1095-7162
DOI: 10.1137/16m1062454